Sperner labellings: A combinatorial approach
نویسندگان
چکیده
منابع مشابه
A Combinatorial Approach toward Factors Empowering Developmental Coaches and Deputies
The present research has aimed to present a model for and identify the dimensions and components of empowering developmental coaches and deputies in high schools. Taking a mixed, exploratory approach, the research used the strategy derived from grounded theory in the qualitative section, while a descriptive-survey method was used in the quantitative section. The statistical population for the f...
متن کاملSperner capacities
We determine the asymptotics of the largest family of qualitatively 2{independent k{ partitions of an n{set, for every k > 2. We generalize a Sperner-type theorem for 2{partite sets of KK orner and Simonyi to the k{partite case. Both results have the feature that the corresponding trivial information-theoretic upper bound is tight. The results follow from a more general Sperner capacity theorem...
متن کاملSperner Oiks
The idea of “Lemke pivoting in a family of oiks (Euler complexes)” generalizes, and abstracts to pure combinatorics, the Lemke-Howson exchange algorithm for finding a Nash equilibrium in bimatrix games, as well as the classical algorithm for finding the properly colored room in Sperner’s Lemma. Given a “room-partitioning”, this algorithm finds another (distinct) room-partitioning by traversing ...
متن کاملExtensions of Sperner and Tucker's lemma for manifolds
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that discs and spheres can be substituted by large classes of manifolds with or without boundary.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2006
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2006.01.006